System Description: Multi A Multi-strategy Proof Planner

نویسندگان

  • Andreas Meier
  • Erica Melis
چکیده

The CASC competitions among automated theorem provers show that there is no single system that outperforms all other systems in all domains. One reaction to this observation is the combination of several systems in a competitive (e.g., the SSCPA system) or cooperative manner (e.g., the CSSCPA and TECHS systems). Thereby, general-purpose heuristics select promising systems to be executed and promising intermediate results to be exchanged. Typically, exchanged results are restricted to clauses or equations that are accepted by all systems. The use of particular domain-specific services for particular subtasks such as the construction of mathematical objects and their flexible cooperation with other services guided by mathematically motivated control knowledge is not possible. Multi-strategy proof planning [10] provides a framework for the flexible collaboration of independent services, so-called strategies, that can realize various operations on proof plans guided by explicitly represented control knowledge. This paper describes the realization of multi-strategy proof planning in the Multi system and illustrates its application in conducted case studies. Although Multi focuses to proof planning techniques, its architecture and concepts are generally applicable for a flexible and knowledge-based cooperation of independent services in theorem proving.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semantically Guided Mega Proof Planner Semantically Guided Mega Proof Planner

Proof planning is an application of AI-planning in mathematical domains. The planning operators, called methods, encode proving steps. One of the strength of proof planning comes from the usage of mathematical knowledge that heuristically restricts the search space. Semantically guided proof planning takes a diierent perspective and uses semantic information as search control heuristics. In thi...

متن کامل

THE UNIVERSITY OF BIRMINGHAM Proof Planning in Ωmega with Semantic Guidance

Proof planning is an application of AI-planning in mathematical domains. The planning operators, called methods, encode proving steps. One of the strength of proof planning comes from the usage of mathematical knowledge that heuristically restricts the search space. Semantically guided proof planning uses semantic information as search control heuristics. In this report we describe the realisat...

متن کامل

Proof Planning with Semantic Guidance

Proof planning [2, 10] is a reasoning process in which mathematical theorem proving is viewed as a planning problem. It incorporates domain-dependent and/or general mathematical knowledge, and shows a great potential in the area where the traditional logicbased theorem proving systems have been typically weak. The plan operator – method – encodes a piece of mathematical knowledge. When there ar...

متن کامل

Classifying Isomorphic Residue Classes

We report on a case study on combining proof planning with computer algebra systems. We construct proofs for basic algebraic properties of residue classes as well as for isomorphisms between residue classes using di erent proving techniques, which are implemented as strategies in a multi-strategy proof planner. We show how these techniques help to successfully derive proofs in our domain and ex...

متن کامل

A Decision Support System for Urban Journey Planning in Multimodal Public Transit Network

The goal of this paper is to develop a Decision Support System (DSS) as a journey planner in complex and large multimodal urban network called Rahyar. Rahyar attempts to identify the most desirable itinerary among all feasible alternatives. The desirability of an itinerary is measured by a disutility function, which is defined as a weighted sum of some criteria. The weight...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005